A Framework for Constraint Programming Based Column Generation

نویسندگان

  • Ulrich Junker
  • Stefan E. Karisch
  • Niklas Kohl
  • Bo Vaaben
  • Torsten Fahle
  • Meinolf Sellmann
چکیده

Column generation is a state of the art method for optimally solving di cult large scale optimization problems such as airline crew as signment We show how to apply column generation even if those prob lems have complex constraints that are beyond the scope of pure OR methods We achieve this by formulating the subproblem as a constraint satisfaction problem CSP We also show how to e ciently treat the special case of shortest path problems by introducing an e cient path constraint that exploits dual values from the master problem to exclude nodes that will not lead to paths with negative reduced costs We demon strate that this propagation signi cantly reduces the time needed to solve crew assignment problems

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving VRPTWs with Constraint Programming Based Column Generation

Constraint programming based column generation is a hybrid optimization framework recently proposed (Junker et al., 1999) that uses constraint programming to solve column generation subproblems. In the past, this framework has been used to solve scheduling problems where the associated graph is naturally acyclic and has done so very efficiently. This paper attempts to solve problems whose graph...

متن کامل

Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search

The Airline Crew Assignment Problem (ACA) consists of assigning lines of work to a set of crew members such that a set of activities is partitioned and the costs for that assignment are minimized. Especially for European airline companies, complex constraints defining the feasibility of a line of work have to be respected. We developed two different algorithms to tackle the large scale optimiza...

متن کامل

Constrained Minimum Sum of Squares Clustering by Constraint Programming

The Within-Cluster Sum of Squares (WCSS) is the most used criterion in cluster analysis. Optimizing this criterion is proved to be NP-Hard and has been studied by different communities. On the other hand, Constrained Clustering allowing to integrate previous user knowledge in the clustering process has received much attention this last decade. As far as we know, there is a single approach that ...

متن کامل

Graph Coloring via Constraint Programming-based Column Generation

This paper presents a Constraint Programming-based Column Generation approach to the Minimum Graph Coloring problem. The proposed approach has two versions of the pricing subproblems: the first version formulates the pricing subproblem as the optimization problem of finding the most negative reduced cost column, the second version as the decision problem of finding a maximal stable set with neg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999